Relations irreducible to classes.
نویسندگان
چکیده
منابع مشابه
Counting Equivalence Classes of Irreducible Representations
Let n be a positive integer, and let R be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether R has at most finitely many equivalence classes of ndimensional irreducible representations. When R does have only finitely many such equivalence classes, they can be effectively counte...
متن کاملDependence Relations in Nonelementary Classes
We study the classK of models of a first order theory T omitting a prescribed set of types, under the assumption that K contains a model with a high level of sequentialhomogeneity. The stability theory of such classes was initiated by Shelah in 1969. We introduce a rank which is bounded when K is א0-stable. The main difficulties are the failure of the compactness theorem forK and the fact that ...
متن کاملClasses of Polynomials Having Only One Non{cyclotomic Irreducible Factor
He noted then that the conjecture is true if n = p 1 2 or if n = p where p is a prime and r a positive integer. Calculations showed the conjecture also held for n 100. Recently, in a study of more general polynomials, the rst author [2] obtained further irreducibility results for f(x); in particular, he established irreducibility in the case that n+ 1 is a squarefree number 3 and in the case th...
متن کامل3 Relations Between Randomized Complexity Classes and Other Complexity Classes
Proof Fix a satisfying assignment a. Define the distance of r to a, denoted dist(r, a), as the number of coordinates where ri 6= ai (this is called Hamming distance). Let r = r, r, r, · · · be the assignments generated by the algorithm, and let di = dist(r , a). Note that as we only change one bit of the assignment, di+1 = di + ∆i where ∆i ∈ {−1, 1}. We claim that Pr[∆i = −1] ≥ 1/2. Once this i...
متن کاملSome connections between powers of conjugacy classes and degrees of irreducible characters in solvable groups
Let $G$ be a finite group. We say that the derived covering number of $G$ is finite if and only if there exists a positive integer $n$ such that $C^n=G'$ for all non-central conjugacy classes $C$ of $G$. In this paper we characterize solvable groups $G$ in which the derived covering number is finite.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1963
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093957576